Generalized pseudoskeleton decompositions
نویسندگان
چکیده
We characterize some variations of pseudoskeleton (also called CUR) decompositions for matrices and tensors over arbitrary fields. These characterizations extend previous results to fields which use generalized inverses the constituent matrices, in contrast Moore–Penrose pseudoinverses prior works are specific real or complex valued significantly more structured.
منابع مشابه
Aggregations over Generalized Hypertree Decompositions
Recent multiway join algorithms have been shown to be asymptotically faster than any sequence of pairwise joins. Generalized Hypertree Decompositions (GHDs), introduced by Gottlob et al., provide a query plan for utilizing these multiway join algorithms to solve conjunctive queries. It is interesting to extend these new algorithms and query plans to more sophisticated queries, e.g. those includ...
متن کاملNew Heuristic Methods for Tree Decompositions and Generalized Hypertree Decompositions
Many practical hard problems in mathematics and computer science may be formulated as constraint satisfaction problems (CSPs). Tree and generalized hypertree decompositions are two important concepts which can be used for identifying and solving tractable classes of CSPs. Unfortunately the task of finding an optimal tree or generalized hypertree decomposition is an NP-complete problem. Thus man...
متن کاملGenetic algorithms for generalized hypertree decompositions
Many practical problems in mathematics and computer science may be formulated as constraint satisfaction problems (CSPs). Although CSPs are NP-hard in general, it has been proven that instances of CSPs may be solved efficiently, if they have generalized hypertree decompositions of small width. Unfortunately, finding a generalized hypertree decomposition of minimum width is an NP-hard problem. B...
متن کاملGaussian Behavior in Generalized Zeckendorf Decompositions
A beautiful theorem of Zeckendorf states that every integer can be written uniquely as a sum of non-consecutive Fibonacci numbers {Fn}n=1; Lekkerkerker proved that the average number of summands for integers in [Fn,Fn+1) is n/(φ2 + 1), with φ the golden mean. This has been generalized to certain classes of linear recurrence relations, where using techniques from number theory and ergodic theory...
متن کاملTabu Search for Generalized Hypertree Decompositions
Many important real world problems can be formulated as Constraint Satisfaction Problems (CSPs). A CSP consists of a set of variables each with a domain of possible values, and a set of constraints on the allowed values for specified subsets of variables. A solution to CSP is the assignment of values to variables, such that no constraint is violated. CSPs include many NP-complete problems and a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2023
ISSN: ['1873-1856', '0024-3795']
DOI: https://doi.org/10.1016/j.laa.2023.01.019